Collectively canalizing Boolean functions
نویسندگان
چکیده
This paper studies the mathematical properties of collectively canalizing Boolean functions, a class functions that has arisen from applications in systems biology. networks are an increasingly popular modeling framework for regulatory networks, and studied here captures key feature biological network dynamics, namely subset one or more variables, under certain conditions, can dominate value function, to exclusion all others. These have rich be explored. The shows how number type such sets influence function's behavior define new measure strength any function. We further connect concept collective canalization with well-studied average sensitivity relationship between dynamics they form is important wide range beyond biology, as computer science, been statistical simulation-based methods. But structure remains largely unexplored, this intended contribution its foundation.
منابع مشابه
On canalizing Boolean functions
Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...
متن کاملBoolean nested canalizing functions: A comprehensive analysis
Boolean network models of molecular regulatory networks have been used successfully in computational systems biology. The Boolean functions that appear in published models tend to have special properties, in particular the property of being nested canalizing, a concept inspired by the concept of canalization in evolutionary biology. It has been shown that networks comprised of nested canalizing...
متن کاملCanalizing Boolean Functions Maximize the Mutual Information
The ability of information processing in biologically motivated Boolean networks is of interest in recent information theoretic research. One measure to quantify this ability is the well known mutual information. Using Fourier analysis we show that canalizing functions maximize the mutual information between an input variable and the outcome of the function. We proof our result for Boolean func...
متن کاملStratification and enumeration of Boolean functions by canalizing depth
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively “picked off”, until a non-canalizing function remains. In this paper, w...
متن کاملPhase transition of Boolean networks with partially nested canalizing functions
We generate the critical condition for the phase transition of a Boolean network governed by partially nested canalizing functions for which a fraction of the inputs are canalizing, while the remaining non-canalizing inputs obey a complementary threshold Boolean function. Past studies have considered the stability of fully or partially nested canalizing functions paired with random choices of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2023
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2022.102475